Technical Note—Generalized Covering Relaxation for 0-1 Programs
نویسندگان
چکیده
منابع مشابه
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs
We consider the general nonlinear optimization problem in 01 variables and provide an explicit equivalent convex positive semidefinite program in 2 − 1 variables. The optimal values of both problems are identical. From every optimal solution of the former one easily find an optimal solution of the latter and conversely, from every solution of the latter one may construct an optimal solution of ...
متن کاملA p-cone sequential relaxation procedure for 0-1 integer programs
Given a 0-1 integer programming problem, several authors have introduced sequential relaxation techniques — based on linear and/or semidefinite programming — that generate the convex hull of integer points in at most n steps. In this paper, we introduce a sequential relaxation technique, which is based on p-order cone programming (1 ≤ p ≤ ∞). We prove that our technique generates the convex hul...
متن کاملLifted Inequalities for 0 − 1 Mixed - Integer Bilinear Covering Sets ∗
4 In this paper, we study 0−1 mixed-integer bilinear covering sets. We derive several families of facet5 defining inequalities via sequence-independent lifting techniques. We then show that these sets have 6 polyhedral structures that are similar to those of certain fixed-charge single-node flow sets. As a result, we 7 obtain new facet-defining inequalities for these sets that generalize well-k...
متن کاملA Recipe for Semide nite Relaxation for ( 0 , 1 ) - Quadratic
We review various relaxations of (0,1)-quadratic programming problems. These include semideenite programs, parametric trust region problems and concave quadratic maximiza-tion. All relaxations that we consider lead to eeciently solvable problems. The main contributions of the paper are the following. Using Lagrangian duality, we prove equivalence of the relaxations in a uniied and simple way. S...
متن کاملRelaxation Heuristics for the Set Covering Problem
The set covering problem (SCP) is one of representative combinatorial optimization problems, which has many practical applications. The continuous development of mathematical programming has derived a number of impressive heuristic algorithms as well as exact branch-and-bound algorithms, which can solve huge SCP instances of bus, railway and airline crew scheduling problems. We survey heuristic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1980
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.28.6.1442